Disposable dynamic accumulators: toward practical privacy-preserving mobile eIDs with scalable revocation
نویسندگان
چکیده
منابع مشابه
Privacy-Preserving Revocation Checking with Modified CRLs
Certificate Revocation Lists (CRLs) are the most popular means of revocation checking. A CRL is essentially a signed and timestamped list containing information about all revoked certificates issued by a certification authority. One of the shortcomings of CRLs is poor scalability which influences update, bandwidth and storage costs. Other, more efficient revocation techniques leak potentially s...
متن کاملA Revocation Scheme Preserving Privacy
broadcast of encrypted data, access to data only with a decryption key the decryption key shown only to the users that pay for transmission. broadcast of encrypted data, access to data only with a decryption key the decryption key shown only to the users that pay for transmission. Main problem – removing some number of users from the system: change the key so that the new key can be decoded onl...
متن کاملSimple and Flexible Privacy-Preserving Revocation Checking
Digital certificates signed by trusted certification authorities (CAs) are used for multiple purposes, most commonly for secure binding of public keys to names and other attributes of their owners. Although a certificate usually includes an expiration time, it is not uncommon that a certificate needs to be revoked prematurely. For this reason, whenever a client (user or program) needs to assert...
متن کاملAccumulators and U-Prove Revocation
This work introduces the most efficient universal accumulator known today. For the first time, we have an accumulator which does not depend on hidden order groups, does not require any exponentiations in the target group associated with the pairing function, and only requires two pairings to verify a proof-of-knowledge of a witness. We present implementations of our accumulator and another rece...
متن کاملDynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
We introduce the notion of a dynamic accumulator. An accumulator scheme allows one to hash a large set of inputs into one short value, such that there is a short proof that a given input was incorporated into this value. A dynamic accumulator allows one to dynamically add and delete a value, such that the cost of an add or delete is independent of the number of accumulated values. We provide a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Security
سال: 2019
ISSN: 1615-5262,1615-5270
DOI: 10.1007/s10207-019-00458-7